Optimizing Search Strategies in k-d Trees
نویسندگان
چکیده
While k-d trees have been widely studied and used, their theoretical advantages are often not realized due to ineffective search strategies and generally poor performance in high dimensional spaces. In this paper we outline an effective search algorithm for k-d trees that combines an optimal depth-first branch and bound (DFBB) strategy with a unique method for path ordering and pruning. Our initial method was developed for improving nearest neighbor (NN) search, but has also proven effective for k-NN search and approximate k-NN classification.
منابع مشابه
P´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملOptimizing the Grade Classification Model of Mineralized Zones Using a Learning Method Based on Harmony Search Algorithm
The classification of mineralized areas into different groups based on mineral grade and prospectivity is a practical problem in the area of optimal risk, time, and cost management of exploration projects. The purpose of this paper was to present a new approach for optimizing the grade classification model of an orebody. That is to say, through hybridizing machine learning with a metaheuristic ...
متن کاملGenerating Floor Plan Layouts with K-d Trees and Evolutionary Algorithms
K-dimensional trees, abbreviated as k-d trees in the following, are binary search and partitioning trees that represent a set of n points in a multi-dimensional space. K-d tree data structures have primarily been used for nearest neighbor queries and several other query types, for example in database applications. In the context of a research project at the Bauhaus-University Weimar concerned w...
متن کاملComparison of nearest-neighbor-search strategies and implementations for efficient shape registration
The iterative closest point (ICP) algorithm is one of the most popular approaches to shape registration currently in use. At the core of ICP is the computationally-intensive determination of nearest neighbors (NN). As of now there has been no comprehensive analysis of competing search strategies for NN. This paper compares several libraries for nearest-neighbor search (NNS) on both simulated an...
متن کاملImproving Growth and Performance of Young Almond Trees in Nursery by Optimizing Mineral Nutrition
Short growing season restricts production of standard-sized fruit trees in nurseries at cold regions. Enhancing plant growth by optimizing program of mineral nutrition may solve the problem. This study evaluated efficiency of fertilizers [urea, sulfur coated urea (SCU), or foliar applications of a NPK compound fertilizer] for optimizing the growth of seedling rootstocks and grafted young almond...
متن کامل